Expansive invertible onesided cellular automata

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expansive Invertible Onesided Cellular Automata

We study expansive invertible onesided cellular automata (i.e., expansive automorphisms of onesided full shifts) and find severe dynamical and arithmetic constraints which provide partial answers to questions raised by M. Nasu [N2]. We employ the images and bilateral dimension groups, measure multipliers, and constructive combinatorial characterizations for two classes of cellular automata.

متن کامل

Invertible Cellular Automata: a Review

In the light of recent developments in the theory of invertible cellular automata, we attempt to give a uniied presentation of the subject and discuss its relevance to computer science and mathematical physics.

متن کامل

Phase Space Invertible Asynchronous Cellular Automata

While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call phase space invertible asynchronous cellular automata in more detail. We will show that for each Turing machine there is such a cellular automaton simulating ...

متن کامل

Some Results on Invertible Cellular Automata

A bst ract . V-Ie address certain questions concern ing invert ible cellular aut omata (ICA) , and present new results in this area . Specifically, we explicitly const ru ct a cellular automaton (CA) in a class (r esidual clas s) previously known not to be empty only via a nonconstr uctive existe nce proof. T his class contains CAs that are invert ible on every fini te suppor t but not on an in...

متن کامل

Some Ergodic Properties of Invertible Cellular Automata

In this paper we consider invertible one-dimensional linear cellular automata (CA hereafter) defined on a finite alphabet of cardinality p, i.e. the maps Tf [l,r] : Z Z pk → Z pk which are given by Tf [l,r](x) = (yn) ∞ n=−∞, yn = f(xn+l, . . . , xn+r) = r

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Mathematical Society of Japan

سال: 2000

ISSN: 0025-5645

DOI: 10.2969/jmsj/05240725